Fast packet classification using field-level trie
نویسندگان
چکیده
Packet classification plays an important role in nextgeneration Internet routers in providing various services such as packet filtering, policy routing, traffic policing, and load balancing. In this paper, we propose an original field-level trie classification (FLTC) scheme that accommodates classifier (rule database) with multiple fields specified in different forms (prefix and range). The FLTC achieves a high classification speed with reasonable storage. It is also highly scalable regarding the size and the number of fields of classifiers.
منابع مشابه
Hierarchical packet classification using a Bloom filter and rule-priority tries
Packet classification techniques have received significant attention in the network literature over the past 10 years, due to its fundamental role in the Internet routers. In recent years, Bloom filter, which is an efficient data structure for membership queries, becomes popular in the network applications. Though Bloom filter allows an error called ‘‘false positives,” the efficiency and the sp...
متن کاملHierarchical trie packet classification algorithm based on expectation-maximization clustering
With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is benef...
متن کاملAM-Trie: A High-Speed Parallel Packet Classification Algorithm for Network Processor
Nowadays, many high-speed Internet services and applications require high-speed multidimensional packet classification, but current high-speed classification often use expensive and power-slurping hardware (such as TCAM and FPGA). In this paper, we present a novel algorithm, called AM-Trie (Asymmetrical Multi-bit Trie). Our algorithm creatively use redundant expression to shorten the height of ...
متن کاملTTSS Packet Classification Algorithm to enhance Multimedia Applications in Network Processor based Router
The objective of this paper is to implement the Trie based Tuple Space Search(TTSS) packet classification algorithm for Network Processor(NP) based router to enhance multimedia applications. The performance is evaluated using Intel IXP2400 NP Simulator. The results demonstrate that, TTSS has better performance than Tuple Space Search algorithm and is well suited to achieve high speed packet cla...
متن کاملA new hierarchical packet classification algorithm
1389-1286/$ see front matter 2012 Elsevier B.V http://dx.doi.org/10.1016/j.comnet.2012.04.014 ⇑ Corresponding author. Tel.: +82 2 3277 3403; fa E-mail address: [email protected] (H. Lim). Packet classification is one of the most challenging functions in Internet routers since it involves a multi-dimensional search that should be performed at wire-speed. Hierarchical packet classification is an ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003